Logic Programming as a Basis for Lean Automated Deduction
نویسندگان
چکیده
> The idea of lean deduction is to achieve maximal efficiency from minimal means. Every possible effort is made to eliminate overhead. Logic programming languages provide an ideal tool for implementing lean deduction, as they offer a level of abstraction that is close to the needs for building firstorder deduction systems. In this paper we describe the principle of lean deduction and present leanTAP , an instance of it implemented in standard Prolog. <
منابع مشابه
Logic Programming as a Basis for Lean Deduction: Achieving Maximal Efficiency from Minimal Means
Researchers in Automated Reasoning often complain that there are sparse applications of the techniques they develop. One reason might be that implementation-oriented research favors huge and highly complex systems and that this does not suit the needs of many applications.1 It is hard to see how to apply these systems – besides using them as a black box. Adaptability, however, is an important c...
متن کاملLogic Programming as a Bases for Lean Deduction: Achieving Maximal Efficiency from Minimal Means
Researchers in Automated Reasoning often complain that there are sparse applications of the techniques they develop. One reason might be that implementation-oriented research favors huge and highly complex systems and that this does not suit the needs of many applications.1 It is hard to see how to apply these systems – besides using them as a black box. Adaptability, however, is an important c...
متن کاملOn Proof Normalization in Linear Logic
We present a proof-theoretic foundation for automated deduction in linear logic. At rst, we systematically study the permutability properties of the inference rules in this logical framework and exploit these to introduce an appropriate notion of forward and backward movement of an inference in a proof. Then we discuss the naturally-arising question of the redundancy reduction and investigate t...
متن کاملA Procedure for Automatic Proof Nets Construction
In this paper, we consider multiplicative linear logic (MLL) from an automated deduction point of view. Linear logic is more expressive than classical and intuitionistic logic and has an undirectional character due to the particular treatment of negation and the absence of structural rules. Considering this new logical framework to make logic programming or programming with proofs (extracting p...
متن کاملModel-Based Deduction for Knowledge Representation
This paper argues that model-based automated deduction techniques are very well suited for knowledge representation purposes. As a motivation we describe three applications and we discuss the requirements for a knowledge representation formalism. The presentation of our KR-system, KRHYPER, is centered aoround the equation KRHYPER = Kernel+ Logic Programming where we put particular emphasis on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Program.
دوره 28 شماره
صفحات -
تاریخ انتشار 1996